Topicality, Predicate Prototypes, and Conceptual Space
نویسندگان
چکیده
منابع مشابه
Topicality, Predicate Prototypes, and Conceptual Space
This paper has the goal of investigating the nature of membership within the category ‘passive’ and cross-linguistic comparison of constructions, ‘passive’ and otherwise. Topicality measures were collected from the Uppsala Corpus of Russian for passive and active uses of the Russian verbs pisat’/napisat’ ‘to write,’ davat’/dat’ ‘to give,’ and zabyvat’/zabyt’ ‘to forget.’ Croft’s (2001) notion o...
متن کاملConceptual and Embodiment Design of Robotic Prototypes
Main advances in artificial intelligence robotics are algorithms, embodied in software on the level of application software. Low-level hardware programming, electronic and mechanics are the necessary basis to enable the implementation of newly developed algorithms. Complex autonomous systems are challenged by tasks that require fast reactions, resulting in high accelerations and forces. These s...
متن کاملCaricatures and Prototypes 1 Conceptual Interrelatedness and Caricatures
Concepts are interrelated to the extent that the characterization each concept is influenced by the other concepts, and isolated to the extent that the characterization of one concept is independent of other concepts. The relative categorization accuracy of the prototype and caricature of a concept can be used as a measure of concept interrelatedness. The prototype is the central tendency of a ...
متن کاملConceptual Spaces with Weighted Prototypes: An Application to Categorization
This thesis introduces a new integrated formalization of the conceptual spaces framework proposed by Gärdenfors. We extend the notion of conceptual space generated by a set of prototypes by adding a weight vector to each prototype. This will allow us to represent non-uniformly scaled concepts and, as a special case, partial concepts. We also present a novel Weighted Prototypes-Based Categorizat...
متن کاملState space reduction using Predicate Filters
In a previous paper, we presented a technique called finite trace covers, in which a program is represented by a set of partial orders. We also presented classes of reachability properties that could be checked in time that is polynomial in the size of the trace cover. A deficiency of this approach was that it did not reduce the complexity of checking properties that did not belong to an effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Universal Language
سال: 2005
ISSN: 1598-6381
DOI: 10.22425/jul.2005.6.1.65